
import java.util.Arrays;

import jleda.graph.*;

public class DijkstraTest {
	public static void main( String[] args ) {
	    int[][] adjmat = new int[3][3];
	    
	    for( int i = 0; i < adjmat.length; i++ ) {
	    	for( int j = 0; j < adjmat[i].length; j++ ) {
	    		adjmat[i][j] = -1;
	    	}
	    }
	    
	    adjmat[0][1] = adjmat[1][0] = 100;
	    adjmat[0][2] = adjmat[2][0] = 200;
	    adjmat[1][2] = adjmat[2][1] = 50;
	    System.out.println(Arrays.toString( Dijkstra.shortestPathLength( adjmat, 0 )));
    }
}
